Von Neumann-Morgenstern Stable Set Bridges Time-Preferences to the Nash Solution
نویسندگان
چکیده
We apply the von Neumann-Morgenstern stable set to the n-player cake division problem. Only time-preferences á la Rubinstein (1982) are assumed. The stable set is defined with respect to the following dominance relation: x dominates y if there is a player who prefers x over y even with one period lag. The Nash bargaining solution is characterized in the language of stable sets. Through the characterization, we establish the existence and uniqueness of the Nash solution.
منابع مشابه
Von Neumann-Morgenstern Stable Sets and the Non-cooperative Solution to the Bargaining Problem
We establish a general n-player link between non-cooperative bargaining and the Nash solution. Non-cooperative bargaining is captured in a reduced form through the von Neumann-Morgenstern (1944) stability concept. A stable set always exists. Moreover, if the utility set has a smooth surface, then any stable set converges to the Nash bargaining solution. Finally, the equivalence of stationary eq...
متن کاملVon Neumann-Morgenstern stable sets, discounting, and Nash bargaining
We establish a link between von Neumann–Morgenstern stable set and the Nash solution in a general n-player utility set. The stable set-solution is defined with respect to a dominance relation: payoff vector u dominates v if one player prefers u even with one period delay. We show that a stable set exists and, if the utility set has a smooth surface, any stable set converges to the Nash bargaini...
متن کاملVon Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching
We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von Neumann-Morgenstern farsightedly stable set if and only if it is a singleton set and its element is a cor...
متن کاملRelative Nash Welfarism
Relative Nash welfarism is a solution to the problem of aggregating von NeumannMorgenstern preferences over a set of lotteries. It ranks such lotteries according to the product of any collection of 0—normalized von Neumann-Morgenstern utilities they generate. We show that this criterion is characterized by the Weak Pareto Principle, Anonymity, and Independence of Harmless Expansions: the social...
متن کاملFarsighted House Allocation
In this note we study von Neumann-Morgenstern farsightedly stable sets for Shapley and Scarf (1974) housing markets. Kawasaki (2008) shows that the set of competitive allocations coincides with the unique von Neumann-Morgenstern stable set based on a farsighted version of antisymmetric weak dominance (cf., Wako, 1999). We demonstrate that the set of competitive allocations also coincides with t...
متن کامل